Arithmetic Autocorrelation Distribution of Binary <i> <b>m</b> </i>-Sequences

Binary sequences with optimal autocorrelation

Exhaustive Search for Low Autocorrelation Binary Sequences

Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconimodel. Computer searches are the main tool to construct such sequences. Due to the exponential size O(2 ) of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run time charact...

Autocorrelation-Run Formula for Binary Sequences

The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for binary sequence that the autocorrelation function is in fact completely determined by its run structure.

$mathcal{I}_2$-convergence of double sequences of\ fuzzy numbers

In this paper, we introduce and study the concepts of $mathcal{I}_2$-convergence, $mathcal{I}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{I}_2$ denotes the ideal of subsets of $mathbb N times mathbb N$. Also, we study some properties and relations of them.

Some Notes on Constructions of Binary Sequences with Optimal Autocorrelation

Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low autocorrelations are presented.